Optimal auctions with ambiguity
نویسندگان
چکیده
A crucial assumption in the optimal auction literature is that each bidder’s valuation is known to be drawn from a unique distribution. In this paper, we study the optimal auction problem allowing for ambiguity about the distribution of valuations. Agents may be ambiguity averse (modeled using the maxmin expected utility model of Gilboa and Schmeidler 1989). When the bidders face more ambiguity than the seller we show that (i) given any auction, the seller can always (weakly) increase revenue by switching to an auction providing full insurance to all types of bidders, (ii) if the seller is ambiguity neutral and any prior that is close enough to the seller’s prior is included in the bidders’ set of priors then the optimal auction is a full insurance auction, and (iii) in general neither the first nor the second price auction is optimal (even with suitably chosen reserve prices). When the seller is ambiguity averse and the bidders are ambiguity neutral an auction that fully insures the seller is in the set of optimal mechanisms.
منابع مشابه
A dynamic mechanism and surplus extraction under ambiguity
We study the question of auction design in an IPV setting characterized by ambiguity. We assume that the preferences of agents exhibit ambiguity aversion; in particular, they are represented by the epsilon-contamination model. We show that a simple variation of a discrete Dutch auction can extract almost all surplus. This contrasts with optimal auctions under IPV without ambiguity as well as wi...
متن کاملAn Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملSealed bid auctions with ambiguity: Theory and experiments
This study presents a laboratory experiment of the first and second price sealed bid auctions with independent private values, where the distribution of bidder valuations may be unknown. In our experimental setting, in first price auctions, bids are lower with the presence of ambiguity. This result is consistent with ambiguity loving in a model that allows for different ambiguity attitudes. We ...
متن کاملReference-Dependent Preferences in First Price Auctions
In this paper I develop a Prospect theory based model to explain bidding in first-price auctions. As suggested in the literature, bidding occurs in these auctions in an inherently ambiguous environment due to lack of information about bidders’ risk attitudes and bidding strategies. I show that bidding in first-price auctions can be rationalized as a combination of reactions to underlying ambigu...
متن کامل